排序方式: 共有86条查询结果,搜索用时 15 毫秒
1.
2.
在求两个数的最大公约数算法的基础上,研究了求多个数的最大公约数的算法,并利用C语言实现了枚举法、辗转相除法和更相减损术三种算法的程序设计。 相似文献
3.
4.
Let n = me and p be an odd prime. Let Fp be a finite field and Fpn be its nth field extension. By some polynomial GCD computatlons, this paper characterize the hentness and semi-bentness of two classes of p-ary quadratic functions from Fp^n to Fp with coefficients in Fpe. Moreover, the enumeration formulas of constructed bent functions are obtained for some special cases of m. The results generalize some previous related work. 相似文献
5.
研究了正整数集直积上的最大公因子矩阵结构问题.利用反演和张量积理论的方法,得到该矩阵是正定的这一结果,并进行了证明. 相似文献
6.
Stéphane Malek 《Journal of Dynamical and Control Systems》2009,15(2):277-305
We construct formal power series solutions of nonlinear partial integro-differential equations with Fuchsian and irregular
singularities at the origin of for given initial conditions being formal power series. We give sufficient conditions under which there exist actual sectorial
holomorphic solutions which are Gevrey asymptotic to the given formal series solutions for given 1-summable formal series
initial conditions. A phenomenon of small divisors is observed for the appearance of singularities of the Borel transform
of the constructed formal series due to the presence of the Fuchsian singularity. This property has an effect on the Gevrey
asymptotic order for the constructed holomorphic solutions which becomes larger than the Gevrey order of the initial conditions.
相似文献
7.
本文给出矩阵拟Jordan分解的一般原理以及求有理矩阵的不变因子和初等因子结构的种源程序.矩阵的拟.Jordan分解包括求该矩阵的初等因子结构及相应的变换矩阵. 相似文献
8.
组播为组通信提供一个可扩展的解决方案,而组密钥管理是安全组通信最重要的组成部分。Chaddoud和Varadharajan在安全特定源组播体系结构中利用Yi,Varadharajan和Zhao的分布式公钥加密算法提出了一种信道密钥管理方案。我们首先论证在该算法中使用强的单向散列函数不仅是不必要的,而且诱发敌手利用剩余类环中的零因子对其发起一种被动攻击。其次通过重新配置系统参数,改进后的G算法既能提高抵抗零因子攻击的能力,又能保持理想的语意特性。然后对其方案中组管理者使用的加密密钥进行了简化计算,并分析了其方案不适用于大型安全组通信的原因。 相似文献
9.
李玲 《西北纺织工学院学报》2012,(3):367-369
对任意正整数n,设d(n)表示n的Dirichlet除数函数,即就是n的所有不同正因数的个数.著名的Smarandache可求和因数对问题是指:是否存在无穷多个正整数m及n,使得d(m)+d(n)=d(m+n),其中(m,n)=1.利用初等方法以及著名的陈景润定理研究这一问题,即证明存在无穷多个正整数m及n且(m,n)≤2,使得d(m)+d(n)=d(m+n),其中(m,n)表示m和n的最大公约数.从而将AmarnathMurthy及Charles Ashbacher提出的一个猜想做出了实质性进展. 相似文献
10.
Andrzej Chmielowiec 《Theoretical computer science》2010,411(1):288-4737
In this paper the problem of the number of fixed points for an RSA algorithm is considered. This is an important question from the point of view of any cryptosystem. We have estimated the expected value of this number for randomly chosen RSA parameters. It turned out that it is O(ln2n), and the probability of finding such a point is O(ln2n/n). Thus, these values are really negligible, which had been intuitively expected. 相似文献